Hypercube Network Fault Tolerance: A Probabilistic Approach

Hypercube Network Fault Tolerance: A Probabilistic Approach

Extensive experiments and experience have shown that the well-known hypercube networks are highly fault tolerant. What is frustrating is that it seems very difficult to properly formulate and formally prove this important fact, despite extensive research efforts in the past two decades. Most proposed fault tolerance models for hypercube networks are only able to characterize very rare extreme s...

Probabilistic Analysis on Mesh Network Fault Tolerance

Mesh networks are among the most important interconnection network topologies for large multicomputer systems. Mesh networks perform poorly in tolerating faults in the view of worst-case analysis. On the other hand, such worst cases occur very rarely in realistic situations. In this paper, we study the fault tolerance of 2-D and 3-D mesh networks under a more realistic model in which each netwo...

Adjacent Vertices Fault-tolerance Fanability of Hypercube

In this paper, we introduce the concepts of fault tolerant fanability. We show that the ndimensional hypercube Qn are f-adjacent and l edges fault tolerant (n− f − l)-fanable for n ≥ 3, f + l ≤ n− 2 and l ≥ 1.

Edge-fault tolerance of hypercube-like networks

Fault-Tolerance in Augmented Hypercube Multicomputers

This paper describes different schemes for tolerating faults in augmented hypercube multiprocessors. The architectures considered have a spare assigned to each subset of nodes (cluster). The approaches make use of hardware redundancy in the form of spare nodes and/or links and usually requires modifications in the communication as well as computation algorithms.